Is P Versus NP Formally Independent?

نویسنده

  • Scott Aaronson
چکیده

This is a survey about the title question, written for people who (like the author) see logic as forbidding, esoteric, and remote from their usual concerns. Beginning with a crash course on Zermelo-Fraenkel set theory, it discusses oracle independence; natural proofs; independence results of Razborov, Raz, DeMillo-Lipton, Sazanov, and others; and obstacles to proving P vs. NP independent of strong logical theories. It ends with some philosophical musings on when one should expect a mathematical question to have a definite answer.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

P != NP, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle

Recent results established exponential lower bounds for the length of any Resolution proof for the weak pigeonhole principle. More formally, it was proved that any Resolution proof for the weak pigeonhole principle, with n holes and any number of pigeons, is of length fl(2 ), (for a constant e = 1/3). One corollary is that certain propositional formulations of the statement P / NP do not have s...

متن کامل

$P \ne NP$, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle

Recent results established exponential lower bounds for the length of any Resolution proof for the weak pigeonhole principle. More formally, it was proved that any Resolution proof for the weak pigeonhole principle, with n holes and any number of pigeons, is of length Ω(2n ǫ ), (for a constant ǫ = 1/3). One corollary is that certain propositional formulations of the statement P 6= NP do not hav...

متن کامل

Qualitative Study of Nocebo Phenomenon (NP) Involved in Doctor-Patient Communication

Background Doctor-patient communication has far reaching influences on the overall well-being of the patients. Words are powerful tools in the doctor’s armamentarium, having both healing as well as harming effects. Doctors need to be conscious about the choice of their words. This study aimed to determine the frequency and pattern of Nocebo Phenomenon (NP) un-intentionally induced by the commun...

متن کامل

Resource Bounded Unprovability O F Computational Lower Bounds (part 1)

This paper shows that the proof complexity (minimum computational complexity of proving formally or asymptotically) of \P 6=NP" is super-polynomial-time with respect to a theory T , which is a consistent extension of Peano Arithmetic (PA), and PTM-!-consistent, where the PTM-!-consistency is a polynomial-time Turing machine (PTM) version of !consistency. In other words, to prove \P 6=NP" (by an...

متن کامل

The "P-NP" problem and the deterministic or time-independent nature of Mathematics

The relationship between the complexity classes P and NP is an unsolved question in the field of theoretical computer science. After a brief presentation, this paper looks at the relation between the P NP question and the “Deterministic” versus “Non Deterministic” nature of a problem. Let us remind that the NP class is called the class of “Non Deterministic Polynomial” languages. Using the meta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Bulletin of the EATCS

دوره 81  شماره 

صفحات  -

تاریخ انتشار 2003